A remark on ‘‘pairs” of regular functions
نویسندگان
چکیده
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
A Remark on C Infinity-harmonic Functions
In this paper, we prove that any nonconstant, C2 solution of the infinity Laplacian equation uxiuxj uxixj = 0 can not have interior critical points. This result was first proved by Aronsson [2] in two dimensions. When the solution is C4, Evans [6] established a Harnack inequality for |Du|, which implies that non-constant C4 solutions have no interior critical points for any dimension. Our metho...
متن کاملA Remark on Computing Distance Functions
We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phys. 119, 146). It is based mainly on the use of a truly upwind discretization near the interface. ...
متن کاملA remark on boundedness of composition operators between weighted spaces of holomorphic functions on the upper half-plane
In this paper, we obtain a sucient condition for boundedness of composition operators betweenweighted spaces of holomorphic functions on the upper half-plane whenever our weights are standardanalytic weights, but they don't necessarily satisfy any growth condition.
متن کاملRegressive functions on pairs
We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n,m), the least l such that any regressive function f : [m, l] → N admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1972
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1972-0291426-0